Prefiltering Two-Dimensional Polygons without Clipping

نویسندگان

  • Zhouchen Lin
  • Hai-Tao Chen
  • Harry Shum
  • Jian Wang
چکیده

In this paper, an improved algorithm for prefiltering two-dimensional polygons is presented. The part of the polygon within the mask of a filter is decomposed into basic component regions whose parameters can be easily computed. Given the parameters, the integral of the filter over the basic component region can be looked up from a table or even be computed with a closed-form solution. The integral or its negative is then added to the accumulation buffer of the pixel according to whether the pixel center is outside the component region or not. After travelling all polygon edges, the accumulation buffers are shifted by integers so that they are all between 0 and 1. In this way, the expensive clipping of the polygons against the filter mask becomes unnecessary.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Edge Labeling Approach to Concave Polygon Clipping

This paper describes an algorithm to perform clipping of two possibly concave polygons. The approach labels the edges of the input polygons. This labeling is used in classifying the resulting polygons in the sets A \ B, A n B and B n A. It is shown that its worst-case time complexity is not worse than the worst-case complexity of the problem of polygon clipping itself. Suggestions are made how ...

متن کامل

Overlapping Area Computation between Irregular Polygons for Its Evolutionary Layout Based on Convex Decomposition

Low efficiency of interference calculation has become the bottleneck that restricts further development of the performance of evolutionary algorithm for the polygon layout. To solve the problem, in this paper, we propose an algorithm of calculating overlapping area between two irregular polygons. For this algorithm, at first, two irregular polygons are respectively decomposed into the minimum n...

متن کامل

Pre-filtering 2D Polygons without Clipping

In this paper, an improved algorithm for pre-filtering 2D polygons is presented. The part of the polygon within the mask of a filter is decomposed into basic component regions whose parameters can be easily computed. Given the parameters, the integral of the filter over the basic component region can be looked up from a table or even be computed with a closed-form solution. The integral or its ...

متن کامل

Ear-clipping Based Algorithms of Generating High-quality Polygon Triangulation

A basic and an improved ear-clipping based algorithm for triangulating simple polygons and polygons with holes are presented. In the basic version, the ear with smallest interior angle is always selected to be cut in order to create fewer sliver triangles. To reduce sliver triangles in further, a bound of angle is set to determine whether a newly formed triangle has sharp angles, and edge swapp...

متن کامل

Experiments on Parallel Polygon Triangulation Using Ear Clipping

We present an experimental study of different strategies for triangulating polygons in parallel. As usual, we call three consecutive vertices of a polygon an ear if the triangle that is spanned by them is completely inside of the polygon. Extensive tests on thousands of sample polygons indicate that most polygons have a linear number of ears. This experimental result suggests that polygon-trian...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Graphics Tools

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2005